An Effective S-box Construction Based on Linear Recurrences with Constant Co-Efficient

نویسندگان

چکیده

In this paper, we propose an algorithm for the construction of substitution-box (S-box) through a linear recurrence relation. S-box is considered as building block ciphers; here, present technique to construct S-boxes by using relation comply with standards cryptographically secure S-box. We have witnessed that latest research relies more on improving already existing techniques, rather than developing wholly new methods. use design in entirely way. Real values, including initial and obtained are concealed converting it into numbers avoid any pattern follow. The analyzed benchmark performance tests check strength quality our proposed S-boxes. Later, used encrypt image also performed encryption decryption data noisy channels make applicable low profile applications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Construction of Equidistributed Generators Based on Linear Recurrences Modulo 2

Random number generators based on linear recurrences modulo 2 are widely used and appear in different forms, such as the simple and combined Tausworthe generators, the GFSR, and the twisted GFSR generators. Low-discrepancy point sets for quasi-Monte Carlo integration can also be constructed based on these linear recurrences. The quality of these generators or point sets is usually measured by c...

متن کامل

Linear Recurrences with Constant Coeecients: the Multivariate Case

While in the univariate case solutions of linear recurrences with constant coeecients have rational generating functions, we show that the multivariate case is much richer: even though initial conditions have rational generating functions, the corresponding solutions can have generating functions which are algebraic but not rational, D-nite but not algebraic, and even non D-nite.

متن کامل

Linear recurrences with constant coefficients: the multivariate case

While in the univariate case solutions of linear recurrences with constant coe cients have rational generating functions we show that the multivariate case is much richer even though initial conditions have rational generating functions the corresponding solutions can have generating functions which are algebraic but not rational D nite but not algebraic and even non D nite Introduction The aim...

متن کامل

Diophantine Equations Related with Linear Binary Recurrences

In this paper we find all solutions of four kinds of the Diophantine equations begin{equation*} ~x^{2}pm V_{t}xy-y^{2}pm x=0text{ and}~x^{2}pm V_{t}xy-y^{2}pm y=0, end{equation*}% for an odd number $t$, and, begin{equation*} ~x^{2}pm V_{t}xy+y^{2}-x=0text{ and}text{ }x^{2}pm V_{t}xy+y^{2}-y=0, end{equation*}% for an even number $t$, where $V_{n}$ is a generalized Lucas number. This pape...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Wireless Personal Communications

سال: 2022

ISSN: ['1572-834X', '0929-6212']

DOI: https://doi.org/10.1007/s11277-021-09396-x